Noisy Simon Period Finding

Let \(f: \mathbb {F}_2^n \rightarrow {F}_2^n\) be a Boolean function with period \(\mathbf {s}\). It is well-known that Simon’s algorithm finds {s}\) in time polynomial n on quantum devices are capable of performing error-correction. However, today’s inherently noisy, too limited for error correction, and not error-tolerant.